Superposition for Lambda-Free Higher-Order Logic
نویسندگان
چکیده
We introduce refutationally complete superposition calculi for intentional and extensional λ-free higher-order logic, a formalism that allows partial application and applied variables. The intentional variants perfectly coincide with standard superposition on first-order clauses. The calculi are parameterized by a well-founded term order that need not be compatible with arguments, making it possible to employ the λ-free higher-order lexicographic path and Knuth–Bendix orders. We implemented the calculi in the Zipperposition prover and evaluated them on TPTP benchmarks. They appear promising as a stepping stone towards complete, efficient automatic theorem provers for full higher-order logic.
منابع مشابه
A Lambda-Free Higher-Order Recursive Path Order
We generalize the recursive path order (RPO) to higher-order terms without λ-abstraction. This new order fully coincides with the standard RPO on first-order terms also in the presence of currying, distinguishing it from previous work. It has many useful properties, including well-foundedness, transitivity, stability under substitution, and the subterm property. It appears promising as the basi...
متن کاملImplementation of Lambda-Free Higher-Order Superposition
In the last decades, first-order logic (FOL) has become a standard language for describing a large number of mathematical theories. Numerous proof systems for FOL which determine what formulas are universally true emerged over time. On the other hand, higher-order logic (HOL) enables one to describe more theories and to describe existing theories more succinctly. Due to more complicated higher-...
متن کاملA Transfinite Knuth-Bendix Order for Lambda-Free Higher-Order Terms
We generalize the Knuth–Bendix order (KBO) to higher-order terms without λ-abstraction. The restriction of this new order to first-order terms coincides with the traditional KBO. The order has many useful properties, including transitivity, the subterm property, compatibility with contexts (monotonicity), stability under substitution, and well-foundedness. Transfinite weights and argument coeff...
متن کاملFormalization of Recursive Path Orders for Lambda-Free Higher-Order Terms
This Isabelle/HOL formalization de nes recursive path orders (RPOs) for higher-order terms without λ-abstraction and proves many useful properties about them. The main order fully coincides with the standard RPO on rst-order terms also in the presence of currying, distinguishing it from previous work. An optimized variant is formalized as well. It appears promising as the basis of a higher-orde...
متن کاملHigher Order Logic Programming with Untyped Lambda Expressions
A higher order logic programming system is presented. The declarative semantics of the system is based on the type-free higher order logic NaDSyL, which takes a nominalist approach to solving the set-theoretic paradoxes. The operational semantics is based on the deterministic and useful subset of higher order uni cation known as pattern uni cation. It is shown that the system allows all express...
متن کامل